// ========================================================================= //

// includes
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "string.h"
#include "limits.h"
#include "float.h"



#define JOTAI_NUM_RANDS_ 25

const unsigned rand_primes[JOTAI_NUM_RANDS_] = {179, 103, 479, 647, 229, 37, 271, 557, 263, 607, 18743, 50359, 21929, 48757, 98179, 12907, 52937, 64579, 49957, 52567, 507163, 149939, 412157, 680861, 757751};

int next_i() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_];
}

float next_f() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_] / 757751.0F;
} 


// Usage menu
void usage() {
    printf("%s", "Usage:\n\
    prog [ARGS]\n\
\nARGS:\n\
       0            int-bounds\n\
       1            big-arr\n\
       2            big-arr-10x\n\
       3            empty\n\
\n\
");

}


// ------------------------------------------------------------------------- //

#define NULL ((void*)0)
typedef unsigned long size_t;  // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__;  // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */
typedef  struct TYPE_5__   TYPE_2__ ;
typedef  struct TYPE_4__   TYPE_1__ ;

/* Type definitions */
typedef  scalar_t__ ut64 ;
struct TYPE_5__ {scalar_t__ data; } ;
struct TYPE_4__ {scalar_t__ offset; } ;
typedef  TYPE_1__ RIOGprobe ;
typedef  TYPE_2__ RIODesc ;
typedef  int /*<<< orphan*/  RIO ;

/* Variables and functions */
 scalar_t__ GPROBE_SIZE ; 
#define  SEEK_CUR 130 
#define  SEEK_END 129 
#define  SEEK_SET 128 

__attribute__((used)) static ut64 __lseek (RIO *io, RIODesc *fd, ut64 offset, int whence) {
	RIOGprobe *gprobe;
	if (!fd || !fd->data) {
		return offset;
	}
	gprobe = (RIOGprobe *)fd->data;
	switch (whence) {
	case SEEK_SET:
		if (offset >= GPROBE_SIZE) {
			return gprobe->offset = GPROBE_SIZE - 1;
		}
		return gprobe->offset = offset;
	case SEEK_CUR:
		if ((gprobe->offset + offset) >= GPROBE_SIZE) {
			return gprobe->offset = GPROBE_SIZE - 1;
		}
		return gprobe->offset += offset;
	case SEEK_END:
		return gprobe->offset = GPROBE_SIZE - 1;
	}
	return offset;
}

// ------------------------------------------------------------------------- //

int main(int argc, char *argv[]) {

    if (argc != 2) {
        usage();
        return 1;
    }

    int opt = atoi(argv[1]);
    switch(opt) {

    // int-bounds
    case 0:
    {
          long offset = 100;
        
          int whence = 100;
        
          int _len_io0 = 1;
          int * io = (int *) malloc(_len_io0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_io0; _i0++) {
            io[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_fd0 = 1;
          struct TYPE_5__ * fd = (struct TYPE_5__ *) malloc(_len_fd0*sizeof(struct TYPE_5__));
          for(int _i0 = 0; _i0 < _len_fd0; _i0++) {
              fd[_i0].data = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          long benchRet = __lseek(io,fd,offset,whence);
          printf("%ld\n", benchRet); 
          free(io);
          free(fd);
        
        break;
    }
    // big-arr
    case 1:
    {
          long offset = 255;
        
          int whence = 255;
        
          int _len_io0 = 65025;
          int * io = (int *) malloc(_len_io0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_io0; _i0++) {
            io[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_fd0 = 65025;
          struct TYPE_5__ * fd = (struct TYPE_5__ *) malloc(_len_fd0*sizeof(struct TYPE_5__));
          for(int _i0 = 0; _i0 < _len_fd0; _i0++) {
              fd[_i0].data = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          long benchRet = __lseek(io,fd,offset,whence);
          printf("%ld\n", benchRet); 
          free(io);
          free(fd);
        
        break;
    }
    // big-arr-10x
    case 2:
    {
          long offset = 10;
        
          int whence = 10;
        
          int _len_io0 = 100;
          int * io = (int *) malloc(_len_io0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_io0; _i0++) {
            io[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_fd0 = 100;
          struct TYPE_5__ * fd = (struct TYPE_5__ *) malloc(_len_fd0*sizeof(struct TYPE_5__));
          for(int _i0 = 0; _i0 < _len_fd0; _i0++) {
              fd[_i0].data = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          long benchRet = __lseek(io,fd,offset,whence);
          printf("%ld\n", benchRet); 
          free(io);
          free(fd);
        
        break;
    }
    // empty
    case 3:
    {
          long offset = ((-2 * (next_i()%2)) + 1) * next_i();
        
          int whence = ((-2 * (next_i()%2)) + 1) * next_i();
        
          int _len_io0 = 1;
          int * io = (int *) malloc(_len_io0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_io0; _i0++) {
            io[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int _len_fd0 = 1;
          struct TYPE_5__ * fd = (struct TYPE_5__ *) malloc(_len_fd0*sizeof(struct TYPE_5__));
          for(int _i0 = 0; _i0 < _len_fd0; _i0++) {
              fd[_i0].data = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          long benchRet = __lseek(io,fd,offset,whence);
          printf("%ld\n", benchRet); 
          free(io);
          free(fd);
        
        break;
    }
    default:
        usage();
        break;

    }

    return 0;
}
